Smart metasurface with self-adaptively reprogrammable functions

Adaptively Secure Constrained Pseudorandom Functions

A constrained pseudo random function (PRF) behaves like a standard PRF, but with the added feature that the (master) secret key holder, having secret key K, can produce a constrained key, Kf , that allows for the evaluation of the PRF on a subset of the domain as determined by a predicate function f within some family F . While previous constructions gave constrained PRFs for poly-sized circuit...

Utility functions for adaptively executing concurrent workflows

Workflows are widely used in applications that require coordinated use of computational resources. Workflow definition languages typically abstract over some aspects of the way in which a workflow is to be executed, such as the level of parallelism to be used or the physical resources to be deployed. As a result, a workflow management system has responsibility for establishing how best to map t...

Smart Bolometer: Toward Monolithic Bolometer with Smart Functions

Self-Timed SRAM with Smart Latency Bundling Self-Timed SRAM with Smart Latency Bundling

In energy-aware design, especially for systems with uncertain power sources, asynchronous computation loads which can function under variable power supply have many potential advantages. Fully safe asynchronous loads based on delay insensitivity (DI), however, tend to suffer power and size penalties. As a compromise, delay bundling has been widely used in asynchronous computation, but tradition...

Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model

We study the adaptive security of constrained PRFs in the standard model. We initiate our exploration with puncturable PRFs. A puncturable PRF family is a special class of constrained PRFs, where the constrained key is associated with an element x′ in the input domain. The key allows evaluation at all points x 6= x′. We show how to build puncturable PRFs with adaptive security proofs in the sta...